Boolean Satisfiability From Theoretical Hardness to Practical SuccessMALIK, Sharad; LINTAO ZHANG.Communications of the ACM. 2009, Vol 52, Num 8, pp 76-82, issn 0001-0782, 7 p.Article

Foundations of fuzzy sets : a nonstandard approachDROSSOS, C. A.Fuzzy sets and systems. 1990, Vol 37, Num 3, pp 287-307, issn 0165-0114, 21 p.Article

Soft evaluation of Boolean search queries in information retrieval systemsPAICE, C. D.Information technology: research and development. 1984, Vol 3, Num 1, pp 33-41Article

Generalized boolean methods of information retrievalRADECKI, T.International journal of man-machine studies. 1983, Vol 18, Num 5, pp 407-439, issn 0020-7373Article

Optimal binary symmetric logic functions and their applicationsYAO LI; HA, B; EICHMANN, G et al.Optical engineering (Bellingham. Print). 1989, Vol 28, Num 4, pp 380-389, issn 0091-3286, 10 p.Article

End user boolean searching on viewdata using numeric keypadsPOLLITT, S.International online information meeting. 9. sd, pp 373-379Conference Paper

Exercises in quantifier manipulationBACKHOUSE, Roland; MICHAELIS, Diethard.Lecture notes in computer science. 2006, pp 69-81, issn 0302-9743, isbn 3-540-35631-2, 1Vol, 13 p.Conference Paper

Solving difficult SAT instances in the presence of symmetryALOUL, Fadi A; RAMANI, Arathi; MARKOV, Igor L et al.Design automation conference. 2002, pp 731-736, isbn 1-58113-461-4, 6 p.Conference Paper

Separating distribution-free and mistake-bound learning models over the Boolean domainBLUM, A. L.SIAM journal on computing (Print). 1994, Vol 23, Num 5, pp 990-1000, issn 0097-5397Article

Synthèse et optimisation temporelle de réseaux Booléens = Synthesis and timing optimization of Boolean networksSakouti, Khalid; Crastes De Paulet, André.1993, 155 p.Thesis

Functionality of multilayer boolean neural networksAL-ALAWI, R; STONHAM, T. J.Electronics Letters. 1989, Vol 25, Num 10, pp 657-659, issn 0013-5194, 3 p.Article

De Boolese benadering bij geautomatiseerde gegevensopzœkingen: vooronderstellingen en kritiek = L'approche booléenne dans les recherches documentaires automatiques: hypothèses et critiquesROUSSEAU, R.Bibliotheek- en archiefgids - Vlaamse vereniging voor bibliotheek-, archief-, en documentatiewezen. 1986, Vol 62, Num 1, pp 67-73, issn 0772-7003Article

Looking algebraically at tractable quantified boolean formulasHUBIE CHEN; DALMAU, Victor.Lecture notes in computer science. 2005, pp 71-79, issn 0302-9743, isbn 3-540-27829-X, 9 p.Conference Paper

New cryptographic primitives based on multiword T-functionsKLIMOV, Alexander; SHAMIR, Adi.Lecture notes in computer science. 2004, pp 1-15, issn 0302-9743, isbn 3-540-22171-9, 15 p.Conference Paper

Lemma and model caching in decision procedures for quantified Boolean formulasLETZ, Reinhold.Lecture notes in computer science. 2002, pp 160-175, issn 0302-9743, isbn 3-540-43929-3, 16 p.Conference Paper

QuBE : A system for deciding quantified boolean formulas satisfiabilityGIUNCHIGLIA, Enrico; NARIZZANO, Massimo; TACCHELLA, Armando et al.Lecture notes in computer science. 2001, pp 364-369, issn 0302-9743, isbn 3-540-42254-4Conference Paper

Use of electron trapping materials in optical signal processing. I, Parallel Boolean logicJUTAMULIA, S; STORTI, G. M; LINDMAYER, J et al.Applied optics. 1990, Vol 29, Num 32, pp 4806-4811, issn 0003-6935Article

An extension of logic functions on the quaternary Boolean ringNAKAO, Z.Transactions of the Institute of Electronics and Communication Engineers of Japan. Section E. 1986, Vol 69, Num 11, pp 1169-1172, issn 0387-236XArticle

AN ADDITIONAL REMARK ON SELF-CONJUGATE FUNCTIONS ON BOOLEAN ALGEBRASSUDKAMP TA.1978; NOTRE DAME J. FORM. LOGIC; USA; DA. 1978; VOL. 19; NO 4; PP. 637-638; BIBL. 1 REF.Article

A COMPLETE CLASSIFICATION OF THREE-PLACE FUNCTORS IN TWO-VALUED LOGIC.MUZIO JC.1976; NOTRE DAME J. FORM. LOGIC; U.S.A.; DA. 1976; VOL. 17; NO 3; PP. 429-437; BIBL. 6 REF.Article

AN AXIOMATIC CHARACTERIZATION OF BOOLEAN-VALUED MODELS FOR SET THEORYKOSCIELSKI A.1973; COLLOQ. MATH.; POLOGNE; DA. 1973; VOL. 27; NO 2; PP. 165-170; BIBL. 2 REF.Serial Issue

Formal verification of infinite state systems using boolean methodsBRYANT, Randal E.Lecture notes in computer science. 2006, pp 1-3, issn 0302-9743, isbn 3-540-36834-5, 1Vol, 3 p.Conference Paper

Resources, concurrency and local reasoningO'HEARN, Peter W.Lecture notes in computer science. 2004, pp 49-67, issn 0302-9743, isbn 3-540-22940-X, 19 p.Conference Paper

Méthodes d'induction dans les bases de donnéesGUENOCHE, A.Recherche d'informations assistée par ordinateur. Colloque. 1985, pp 403-414Conference Paper

Poly-logarithmic Independence Fools Bounded-Depth Boolean CircuitsBRAVERMAN, Mark.Communications of the ACM. 2011, Vol 54, Num 4, pp 108-115, issn 0001-0782, 8 p.Article